Common ancestor for concanavalin A and lentil lectin?
نویسندگان
چکیده
منابع مشابه
Thermodynamics of monosaccharide binding to concanavalin A, pea (Pisum sativum) lectin, and lentil (Lens culinaris) lectin.
Titration calorimetry measurements of the binding of methyl alpha-D-mannopyranoside (Me alpha Man), D-mannopyranoside (Man), methyl alpha-D-glucopyranoside (Me alpha Glu), and D-glucopyranoside (Glu) to concanavalin A (Con A), pea lectin, and lentil lectin were performed at 281 and 292 K in 0.01 M dimethylglutaric acid-NaOH buffer (pH 6.9) containing 0.15 M NaCl and Mn+2 and Ca+2 ions. The site...
متن کاملEffect of substituent on the thermodynamics of D-glucopyranoside binding to concanavalin A, pea (Pisum sativum) lectin and lentil (Lens culinaris) lectin.
Titration calorimetry measurements of the binding of phenyl-alpha (alpha PhOGlu), 3-methoxy (3MeOGlu), fluorodeoxy and deoxy derivatives of alpha-D-glucopyranose (Glu) to concanavalin A (conA), pea lectin and lentil lectin were performed at approx. 10 and 25 degrees C in 0.01 M dimethylglutaric acid/NaOH buffer, pH 6.9, containing 0.15 M NaCl and Mn2+ and Ca2+ ions. Apparently the 3-deoxy, 4-de...
متن کاملLowest Common Ancestor(LCA)
Before embarking into the technicalities of the different algorithms for LCA, let us first agree on the terminology that we will be using throughout this article. Let there be a rooted tree T(E,V). A node x ∈ T is called an ancestor of a node y ∈ T if the path from the root of T to y goes through x. Also, a node v ∈ T is called to be a common ancestor of x and y if it is an ancestor of both x a...
متن کامل2 Least Common Ancestor
In particular, we are allowed to preprocess the texts in order to be able to answer the query faster. Our preprocessing choice was the use of a single suffix tree, in which all the suffixes of all the texts appear, each suffix ending with a distinct symbol that determines the text in which the suffix appears. In order to answer the query we reduced the problem to range-min queries, which in tur...
متن کاملLeast Common Ancestor Networks
Least Common Ancestor Networks (LCANs) are introduced and shown to be a class of networks that include fat-trees, baseline networks, SW-banyans and the router networks of the TRAC 1.1 and 2.0, and the CM-5. Some LCAN properties are stated and the permutation routing capabilities of an important subclass are analyzed. Simulation results for three permutation classes verify the accuracy of an ite...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 1978
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.75.3.1136